全文获取类型
收费全文 | 146篇 |
免费 | 23篇 |
国内免费 | 1篇 |
专业分类
化学 | 9篇 |
数学 | 154篇 |
物理学 | 7篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 8篇 |
2017年 | 6篇 |
2016年 | 7篇 |
2015年 | 3篇 |
2014年 | 13篇 |
2013年 | 12篇 |
2012年 | 3篇 |
2011年 | 15篇 |
2010年 | 9篇 |
2009年 | 6篇 |
2008年 | 11篇 |
2007年 | 9篇 |
2006年 | 6篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 7篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 2篇 |
1999年 | 2篇 |
1998年 | 6篇 |
1997年 | 2篇 |
1996年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1976年 | 2篇 |
排序方式: 共有170条查询结果,搜索用时 78 毫秒
1.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ ()
n
−ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour
number μ(G) of G: n− (n−ω)()
n
−ω≤μ(G)≤n−α() α.
Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002 相似文献
2.
本文利用比较原理以及一种特殊变换研究了一类非线性退化方程的混合问题,得到了这类复杂问题解的渐进性质。 相似文献
3.
4.
Guido Consonni Piero Veronese 《Annals of the Institute of Statistical Mathematics》1993,45(2):303-315
Given two random variables (X, Y) the condition of unbiasedness states that:E(X |Y=y)=y andE(Y |X=x)=x both almost surely (a.s.). If the prior onY is proper and has finite expectation or non-negative support, unbiasedness impliesX=Y a.s. This paper examines the implications of unbiasedness when the prior onY is improper. Since the improper case can be meaningfully analysed in a finitely additive framework, we revisit the whole issue of unbiasedness from this perspective. First we argue that a notion weaker than equality a.s., named coincidence, is more appropriate in a finitely additive setting. Next we discuss the meaning of unbiasedness from a Bayesian and fiducial perspective. We then show that unbiasedness and finite expectation ofY imply coincidence betweenX andY, while a weaker conclusion follows if the improper prior onY is only assumed to have positive support. We illustrate our approach throughout the paper by revisiting some examples discussed in the recent literature.This work was partially supported by C.N.R. grant N.80.02970.10 (G.C.) and by C.N.R. grant altri interventi (P.V.). A preliminary draft was written while the Authors were visiting the Department of Statistics at Carnegie Mellon University.The paper is the result of close cooperation between the two authors. However subsections 3.1 and 3.3 are mainly due to G.C. while subsection 3.2 and section 4 are mainly due to P.V. 相似文献
5.
A graph is -colorable if it admits a vertex partition into a graph with maximum degree at most and a graph with maximum degree at most . We show that every -free planar graph is -colorable. We also show that deciding whether a -free planar graph is -colorable is NP-complete. 相似文献
6.
7.
Let m ≤ n ≤ k. An m × n × k 0‐1 array is a Latin box if it contains exactly m n ones, and has at most one 1 in each line. As a special case, Latin boxes in which m = n = k are equivalent to Latin squares. Let be the distribution on m × n × k 0‐1 arrays where each entry is 1 with probability p, independently of the other entries. The threshold question for Latin squares asks when contains a Latin square with high probability. More generally, when does support a Latin box with high probability? Let ε > 0. We give an asymptotically tight answer to this question in the special cases where n = k and , and where n = m and . In both cases, the threshold probability is . This implies threshold results for Latin rectangles and proper edge‐colorings of Kn,n. 相似文献
8.
蒙特卡罗方法计算定积分的进一步讨论 总被引:3,自引:0,他引:3
介绍了蒙特卡罗方法计算定积分的原理和方法.给出了用蒙特卡罗方法计算定积分的一个简单证明,从而揭示了蒙特卡罗方法和定积分定义间的内在联系.针对蒙特卡罗方法收敛慢的特点,提出将蒙特卡罗方法与相应的数值计算方法相结合,提高计算结果的精度.此外,将蒙特卡罗方法推广到反常积分上去. 相似文献
9.
运用牛顿‐莱布尼茨公式和无界函数的反常积分的定义证明无界函数的反常积分的计算定理,运用这个定理计算无界函数的反常积分简单快捷,通过举例说明这个定理的应用,并指出多种大学数学参考书中存在的一个共同错误。 相似文献
10.